Parallel Shortest Path Auction Algorithmsl
نویسنده
چکیده
In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of problems. We discuss the efficiency of the parallel implementation for the many origins-one destination problem, the all origins-one destination problem, and the many origins-many destinations problem. 1 Work supported by NSF under Grants No. DDM-8903385 and CCR-9108058. Thanks are due for comments and assistance with the parallel asynchronous codes to David Castanon. 2 Laboratory for Information and Decision Systems, M.I.T.,Cambridge, Ma, 02139.
منابع مشابه
Experiments with the Auction Algorithm for the Shortest Path Problem
The auction approach for the shortest path problem as introduced by Bert-sekas is tested experimentally. Parallel algorithms using the auction approach are developed and tested. Both the sequential and parallel auction algorithms perform signiicantly worse than a state-of-the-art Dijkstra-like reference algorithm .
متن کاملAn Auction Algorithm for Shortest Paths
A new and simple algorithm for finding shortest paths in a directed graph is proposed. In the single origin-single destination case, the algorithm maintains a single path starting at the origin, which is extended or contracted by a single node at each iteration. Simultaneously, at most one dual variable is adjusted at each iteration so as to either improve or maintain the value of a dual functi...
متن کاملAuction Algorithms for Shortest Hyperpath Problems Auction Algorithms for Shortest Hyperpath Problems
The auction{reduction algorithm is a strongly polynomial version of the auction method for the shortest path problem. In this paper we extend the auction{reduction algorithm to diierent types of shortest hyperpath problems in directed hypergraphs. The results of preliminary computational experiences show that the auction{reduction method is comparable to other known methods for speciic classes ...
متن کاملAuction algorithms for network flow problems: A tutorial introduction
This paper surveys a new and comprehensive class of algorithms for solving the classical linear network flow problem and its various special cases such as shortest path, max-flow, assignment, transportation, and transhipment problems. The prototype method, from which the other algorithms can be derived, is the auction algorithm for the assignment problem. This is an intuitive method that operat...
متن کاملPolynomial auction algorithms for shortest paths
In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/many destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this struct...
متن کامل